Auctions with Limited Commitment∗

نویسندگان

  • Qingmin Liu
  • Konrad Mierendorff
  • Xianwen Shi
چکیده

We study auction design with limited commitment in a standard auction environment. The seller has a single object and can conduct an infinite sequence of standard auctions with reserve prices to maximize her expected profit. In each period, the seller can commit to a reserve price for the current period but cannot commit to future reserve prices. We analyze the problem with limited commitment through an auxiliary mechanism design problem with full commitment, in which an additional constraint reflects the sequential rationality of the seller. We characterize the maximal profit achievable in any perfect Bayesian equilibrium in the limit as the period length vanishes. The static full commitment profit is not achievable but the seller can always guarantee the profit of an efficient auction. If the number of buyers exceeds a cutoff, the efficient auction is optimal. Otherwise, the efficient auction is not optimal, and we give conditions under which the optimal solution consists of an initial auction with a non-trivial reserve price followed by a continuously decreasing price path. The solution is described by a simple ordinary differential equation. Our analysis draws insights from bargaining, auctions, and mechanism design. ∗We wish to thank Jeremy Bulow, Yeon-Koo Che, Jacob Goeree, Faruk Gul, Philippe Jehiel, Navin Kartik, Alessandro Lizzeri, Steven Matthews, Benny Moldovanu, Bernard Salanié, Yuliy Sannikov, Vasiliki Skreta, Andrzej Skrzypacz, Philipp Strack, Alexander Wolitzky, and various seminar and conference audiences for helpful discussions and comments. Parts of this paper were written while some of the authors were visiting the University of Bonn, Columbia University, ESSET at the Study Center Gerzensee, Princeton University, and the University of Zurich. We are grateful for the hospitality of the respective institutions. Mierendorff gratefully acknowledges financial support from the Swiss National Science Foundation and the European Research Council (ESEI-249433). Shi gratefully acknowledges financial support by the Social Sciences and Humanities Research Council of Canada. †Columbia University, [email protected] ‡Columbia University and ESEI–University of Zurich, [email protected] §University of Toronto, [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal auction design under non-commitment

This paper characterizes revenue maximizing auctions for a …nite horizon version of the standard IV P model of Myerson (1981) for a seller who cannot commit not to propose a new mechanism, if previously chosen ones fail to allocate the object. We show that a revenue maximizing mechanism in the …rst period assigns the good to the buyer with the highest virtual valuation, provided that it is abov...

متن کامل

Optimal commitments in auctions with incomplete information

We are interested in the problem of optimal commitments in rank-and-bid based auctions, a general class of auctions that include first price and all-pay auctions as special cases. Our main contribution is a novel approach to solve for optimal commitment in this class of auctions, for any continuous type distributions. Applying our approach, we are able to solve optimal commitments for first-pri...

متن کامل

Collusion through communication in auctions

We study the extent to which communication can serve as a collusion device in one-shot firstand second-price sealed-bid auctions. Theoretically, second-price auctions are more fragile to collusion through communication than first-price auctions. In an array of laboratory experiments we vary the amount of interactions (communication and/or transfers without commitment) available to bidders. We f...

متن کامل

Sequentially Optimal Auctions

In auctions where a seller can post a reserve price but if the object fails to sell cannot commit never to attempt to resell it, revenue equivalence between repeated first price and second price auctions without commitment results. When the time between auctions goes to zero, seller expected revenues converge to those of a static auction with no reserve price. With many bidders, the seller equi...

متن کامل

Network Capacity Auctions: Promise and Problems

Well-designed auctions work well for allocating idiosyncratic properties efficiently. If there is a sufficient number of non-colluding bidders, auctions can reveal the value of the property and maximise the revenue raised. Multiple round auctions can disseminate diffusely held information, though with additional risks of signalling and collusion. Auctions are perceived as more objective and fai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014